On a Vizing-like conjecture for direct product graphs
نویسندگان
چکیده
منابع مشابه
On a Vizing-like conjecture for direct product graphs
Let (G) be the domination number of a graph G, and let G H be the direct product of graphs G and H. It is shown that for any k 0 there exists a graph G such that (G G) (G) 2 ? k. This in particular disproves a conjecture from 5].
متن کاملVizing-like Conjecture for the Upper Domination of Cartesian Products of Graphs - The Proof
In this note we prove the following conjecture of Nowakowski and Rall: For arbitrary graphs G and H the upper domination number of the Cartesian product G H is at least the product of their upper domination numbers, in symbols: Γ(G H) ≥ Γ(G)Γ(H). A conjecture posed by Vizing [7] in 1968 claims that Vizing’s conjecture: For any graphs G and H, γ(G H) ≥ γ(G)γ(H), where γ, as usual, denotes the do...
متن کاملA Note on Tensor Product of Graphs
Let $G$ and $H$ be graphs. The tensor product $Gotimes H$ of $G$ and $H$ has vertex set $V(Gotimes H)=V(G)times V(H)$ and edge set $E(Gotimes H)={(a,b)(c,d)| acin E(G):: and:: bdin E(H)}$. In this paper, some results on this product are obtained by which it is possible to compute the Wiener and Hyper Wiener indices of $K_n otimes G$.
متن کاملProof of a conjecture concerning the direct product of bipartite graphs
We prove that if the direct product of two connected bipartite graphs has isomorphic components, then one of the factors admits an automorphism that interchanges its partite sets. This proves a conjecture made by Jha, Klavžar and Zmazek in 1997 [P. Jha, S. Klavzar, B. Zmazek, Isomorphic components of Kronecker product of bipartite graphs, Discussiones Mathematicae Graph Theory 17 (1997) 302–308...
متن کاملA Vizing-like theorem for union vertex-distinguishing edge coloring
A vertex-distinguishing coloring of a graph G consists in an edge or a vertex coloring (not necessarily proper) of G leading to a labeling of the vertices of G, where all the vertices are distinguished by their labels. There are several possible rules for both the coloring and the labeling. For instance, in a set irregular edge coloring [5], the label of a vertex is the union of the colors of i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(96)00032-5